Petri-net-based deadlock analysis of Process Algebra programs

Petri Net Based Deadlock Analysis of ProcessAlgebra

Recent research has been conducted on representing Process Algebra programs by safe Petri nets. We suggest that such a representation ooers direct beneets: one can use methods that have been developed in the Petri net theory domain, to reason about Process Algebra programs. We propose for a subset of a speciic Process Algebra (Milner's Calculus of Communicating Systems or CCS), a deadlock detec...

Verifying Petri-Net Models Using Process Algebra

The Linear Algebra of Deadlock AvoidanceA Petri

An algorithm is presented which prevents place/transition systems with nitely many states (boundedness) from running into dead markings. The algorithm determines supplementary places which protect structural deadlocks from becoming insuuciently marked. All steps, the determination of minimal deadlocks, the test whether deadlocks can be emptied, the determination of the supplementary places and ...

An admissible-behaviour-based analysis of the deadlock in Petri-net controllers

This paper addresses the problem of verifying the discrete control logic that is typically implemented by programmable controllers. Not only are the logical properties of the controller studied during verification, the behaviour of the overall controlled system is also examined. An approach that combines the calculation of the safety-oriented interlock controllers in terms of supervisory contro...

Task Synchronization Process based on Petri Net

Task synchronization means that each redundant module has the same executing schedule in each task scheduling cycle of the operating system in the Triple Modular Redundancy (abbreviated TMR) fault-tolerant systems; it faces how to realize the coordination among the three modules. Therefore, it is necessary to investigate the task synchronization process of the TMR fault-tolerant system. In the ...